#include <iostream>

using namespace std;

typedef long long LL;

const LL p = 998244353;

int n, k;
//LL f[N], g[N];
//
//void init()
//{
//	f[0] = 1;
//	for(int i = 1; i <= n; i++) f[i] = f[i - 1] * i % p;
//	g[n] = qpow(f[n], p - 2, p);
//	for(int i = n - 1; i >= 0; i--) g[i] = g[i + 1] * (i + 1) % p;
//}

LL qpow(LL a, LL b, LL p)
{
	LL ret = 1;
	while(b)
	{
		if(b & 1) ret = ret * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return ret;
}

LL solve()
{
	LL ret = qpow(2, k, p) - 1; 
    LL ans = qpow(ret, n, p);
    return ans;
}

int main()
{
	cin >> n >> k;
	cout << solve() << endl;
	return 0;
}
